Explicit Nonadaptive Combinatorial Group Testing Schemes
نویسندگان
چکیده
منابع مشابه
When is Individual Testing Optimal for Nonadaptive Group Testing?
The combinatorial group testing problem is, assuming the existence of up to d defectives among n items, to identify the defectives by as few tests as possible. In this paper, we study the problem for what values of n, given d, individual testing is optimal in nonadaptive group testing. Let N(d) denote the largest n for fixed d for which individual testing is optimal. We will show that N(d) = (d...
متن کاملTwo Models of Nonadaptive Group Testing for Designing Screening Experiments
We discuss two non-standard models of nonadaptive combinatorial search which develop the conventional disjunct search model [8] for a small number of defective elements contained in a finite ground set or a population. The first model called a search of defective supersets (complexes) was suggested in [15, 16]. The second model which can be called a search of defective subsets in the presence o...
متن کاملIndividual testing is optimal for nonadaptive group testing in the linear regime
We consider nonadaptive probabilistic group testing in the linear regime, where each of n items is defective independently with probability p ∈ (0, 1), where p is a constant independent of n. We show that testing each item individually is optimal, in the sense that with fewer than n tests the error probability is bounded away from zero.
متن کاملPerformance Evaluation of Two Allocation Schemes for Combinatorial Group Testing Fault Isolation
Two fault isolation approaches based on Combinatorial Group Testing (CGT) are presented. Although they both share the basic principle of grouping suspect resources into subgroups for testing, they differ in the allocation strategy used to achieve that grouping. Equal share CGT approach is analyzed first, results shown successful fault isolation in 85% of the runs. An average of 3.65 groups and ...
متن کاملSmart elements in combinatorial group testing problems
In combinatorial group testing problems the questioner needs to find a special element x ∈ [n] by testing subsets of [n]. Tapolcai et al. [27, 28] introduced a new model, where each element knows the answer for those queries that contain it and each element should be able to identify the special one. Using classical results of extremal set theory we prove that if Fn ⊆ 2 solves the nonadaptive v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448
DOI: 10.1109/tit.2011.2163296